Dynamic Label Placement in Practice

نویسنده

  • Nadine Schwartges
چکیده

We consider the problem of labeling dynamic (3D) maps: we develop real-time algorithms that attach non-overlapping annotations to objects on maps which the user can pan, zoom, and rotate continuously. Existing algorithms either label static maps or only a small number of the objects. We consider the problem to label streets and to label points. We label streets either internally or externally. For internal labels, we compute potential label positions for each street, compare them, and decide for one. For external street labels, we apply a force-directed approach; labels behave like electrons. The first algorithm for labeling points allows labels to slide along their reference points; it makes use of visibilities between labels. The other approach precomputes for each point an interval of zoom levels at which the label can be placed; labelings are queried at run time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments

Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...

متن کامل

Automated label placement in theory and practice

v 1 An Introduction to Label Placement 1 1.1 Historic Development . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Theory. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 . . . and Practice . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.4 Quality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.5 Future Development . . . . . . . . . ....

متن کامل

A fast and practical grid based algorithm for point-feature label placement problem

Point-feature label placement (PFLP) is a major area of interest within the filed of automated cartography, geographic information systems (GIS), and computer graphics. The objective of a label placement problem is to assign a label to each point feature so as to avoid conflicts, considering the cartographic conventions. According to computational complexity analysis, the labeling problem has b...

متن کامل

Label Size Maximization for Rectangular Node Labels

The label placement problem is one of the most important problems in geographic information systems, cartography, graph drawing, and graphical interface design. In this paper, we considered the label size maximization problem for points with axes-parallel rectangular labels that correspond to character strings and have different widths based on the number of characters. We propose an algorithm ...

متن کامل

Fast Point-Feature Label Placement for Dynamic Visualizations (Thesis)

This paper describes a fast approach to automatic point label de-confliction on interactive maps. The general Map Labeling problem is NP-hard and has been the subject of much study for decades. Computerized maps have introduced interactive zooming and panning which has intensified the problem. Providing dynamic labels for such maps typically requires a timeconsuming pre-processing phase. In the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013